A Modal Characterisation of Distributed Bisimulation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Labelled Transition Systems Bisimulation and Distributed Bisimulation Algebraic Characterisation of Distributed Bisimulation Weak Observations Weak Distributed Bisimulation Algebraic Characterisation of Weak Distributed Bisimulation Communication as Mutual Observation towards an Algebraic Characterisation of Weak Distributed Bisimulation with Communication Castellani

In this paper, I will describe and critically evaluate the paper Distributed Bisimulations, by Ilaria Castellani and Matthew Hennessy [5]. The aim of their paper is to generalise bisimulation equivalence for a subset of CCS to take into account the distributed nature of processes and, thus give a noninterleaving semantic theory which has many of the advantages of the interleaving theory. This t...

متن کامل

A Characterisation of Open Bisimulation using an Intuitionistic Modal Logic

Open bisimulation is the greatest bisimulation congruence for the π-calculus. In open bisimulation, free names in processes are treated as variables that may be instantiated; in contrast to late bisimulation where free names are constants. An established modal logic due to Milner, Parrow, and Walker characterises late bisimulation, that is, two processes satisfy the same set of formulae if and ...

متن کامل

Bisimulation and Modal Logics

Modal logic is a family of logics for reasoning about modalities. For example, given a sentence φ, one may wish to express statements such as “φ is necessarily true” or “φ is possibly true”. Modalities are expressed using modal operators. In the most basic modal logic, called propositional modal logic, one may use the operators 2 and 3 to formalize the above two statements as 2φ and 3φ. In this...

متن کامل

A Characterisation of Weak Bisimulation Congruence

This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of states or actions of the processes under consideration.

متن کامل

Bisimulation Quantified Modal Logics: Decidability

Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfortunately, it is not the case that extension by bisimulation quantifiers always preserves the decidability of a modal logic. Here we examine a general class of modal logics for which decidability is preserved under exte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DAIMI Report Series

سال: 1991

ISSN: 2245-9316,0105-8517

DOI: 10.7146/dpb.v20i347.6577